MKPM: Multi keyword-pair matching for natural language sentences
نویسندگان
چکیده
Abstract Sentence matching is widely used in various natural language tasks, such as inference, paraphrase identification and question answering. For these we need to understand the logical semantic relationship between two sentences. Most current methods use all information within a sentence build model hence determine its another sentence. However, contained some sentences may cause redundancy or introduce noise, impeding performance of model. Therefore, propose method based on multi keyword-pair (MKPM), which uses keyword pairs represent them, avoiding interference noise. Specifically, first sentence-pair-based attention mechanism sp-attention select most important word pair from pair, then Bi-task architecture pairs. The follows: 1. In order at level sentences, design word-pair task (WP-Task), complete independently. 2. We sentence-pair (SP-Task) by denoising. Through integration our can more accurately granularities Experimental results show that achieve state-of-the-art several tasks. Our source code publicly available 1 .
منابع مشابه
Bilateral Multi-Perspective Matching for Natural Language Sentences
Natural language sentence matching is a fundamental technology for a variety of tasks. Previous approaches either match sentences from a single direction or only apply single granular (wordby-word or sentence-by-sentence) matching. In this work, we propose a bilateral multi-perspective matching (BiMPM) model. Given two sentences P and Q, our model first encodes them with a BiLSTM encoder. Next,...
متن کاملConvolutional Neural Network Architectures for Matching Natural Language Sentences
Semantic matching is of central importance to many natural language tasks [2, 28]. A successful matching algorithm needs to adequately model the internal structures of language objects and the interaction between them. As a step toward this goal, we propose convolutional neural network models for matching two sentences, by adapting the convolutional strategy in vision and speech. The proposed m...
متن کاملMatching Natural Language Sentences with Hierarchical Sentence Factorization
Semantic matching of natural language sentences or identifying the relationship between two sentences is a core research problem underlying many natural language tasks. Depending on whether training data is available, prior research has proposed both unsupervised distance-based schemes and supervised deep learning schemes for sentence matching. However, previous approaches either omit or fail t...
متن کاملUsing Generalized Language Model for Question Matching
Question and answering service is one of the popular services in the World Wide Web. The main goal of these services is to finding the best answer for user's input question as quick as possible. In order to achieve this aim, most of these use new techniques foe question matching. . We have a lot of question and answering services in Persian web, so it seems that developing a question matching m...
متن کاملSemantic Representation Forms of Natural Language Sentences
The paper proposes a framework for sentence transformation module used in natural language processing. The transformation module performs mapping between the different information representation forms. The work focuses on two intermediate models, the role of predicate calculus formalism and the role of conceptual graph called ECG are investigated in details. Both models provide a semantic-based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Intelligence
سال: 2021
ISSN: ['0924-669X', '1573-7497']
DOI: https://doi.org/10.1007/s10489-021-02306-5